Finding balanced skew partitions in perfect graphs
نویسندگان
چکیده
A graph G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one; and it is known that this is equivalent to being perfect, that is, that the chromatic number of every induced subgraph equals the size of its largest clique. A skew partition in G is a partition (A,B) of V (G) such that G[A] is not connected and G[B] is not connected; and it is balanced if an additional parity condition of paths and antipaths is satisfied. In this paper we give a polynomial-time algorithm which, with input a Berge graph, outputs a balanced skew partition if there is one.
منابع مشابه
Coloring perfect graphs with no balanced skew-partitions
We present an O(n) algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present O(n) time algorithm that colors them.
متن کاملClique-Stable Set separation in perfect graphs with no balanced skew-partitions
We prove that perfect graphs with no balanced skew-partitions admits a O(n) Clique-Stable set separator. We then prove that for every graph G in this class, there always exists two subsets of vertices V1, V2 such that |V1|, |V2| ≥ c|V (G)| for some constant c and V1 is either complete or anticomplete to V2. The method uses trigraphs, introduced by Chudnovsky [5], and relies on the good behavior...
متن کاملClique Stable separation in perfect graphs with no balanced skew-partitions
We prove that perfect graphs with no balanced skew-partitions admits a O(n) Clique-Stable separator. We then prove that for every graph G in this class, there always exists two subsets of vertices V1, V2 such that |V1|, |V2| ≥ c|V (G)| for some constant c and V1 is either complete or anticomplete to V2. The method uses trigraphs, introduced by Chudnovsky [5], and relies on the good behavior of ...
متن کاملSkew partitions in perfect graphs
We discuss some new and old results about skew partitions in perfect graphs. © 2007 Published by Elsevier B.V.
متن کاملDecomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that every Berge graph either is in a well understood basic class or has some kind of decomposition. Then, Chudnovsky proved stronger theorems. One ...
متن کامل